Online Selection of Intervals and t-Intervals
نویسندگان
چکیده
A t-interval is a union of at most t half-open intervals on the real line. An interval is the special case where t = 1. Requests for contiguous allocation of a linear resource can be modeled as a sequence of t-intervals. We consider the problems of online selection of intervals and t-intervals, which show up in Video-on-Demand services, high speed networks and molecular biology, among others. We derive lower bounds and (almost) matching upper bounds on the competitive ratios of randomized algorithms for selecting intervals, 2-intervals and t-intervals, for any t > 2. While offline t-interval selection has been studied before, the online version is considered here for the first time.
منابع مشابه
Confidence Intervals for the Power of Two-Sided Student’s t-test
For the power of two-sided hypothesis testing about the mean of a normal population, we derive a 100(1 − alpha)% confidence interval. Then by using a numerical method we will find a shortest confidence interval and consider some special cases.
متن کاملOnline Scheduling Intervals and t-Intervals
A t-interval is a union of at most t half-open intervals on the real line. The special case where t = 1 is an interval. Often, the requests for contiguous allocation of a linear resource can be modeled by a sequence of t-intervals. We consider the problems of online scheduling intervals and t-intervals, which show up in Video-on-Demand services, high speed networks and molecular biology, among ...
متن کاملMonte Carlo Comparison of Approximate Tolerance Intervals for the Poisson Distribution
The problem of finding tolerance intervals receives very much attention of researchers and are widely used in various statistical fields, including biometry, economics, reliability analysis and quality control. Tolerance interval is a random interval that covers a specified proportion of the population with a specified confidence level. In this paper, we compare approximate tolerance interva...
متن کاملEstimation of Software Reliability by Sequential Testing with Simulated Annealing of Mean Field Approximation
Various problems of combinatorial optimization and permutation can be solved with neural network optimization. The problem of estimating the software reliability can be solved with the optimization of failed components to its minimum value. Various solutions of the problem of estimating the software reliability have been given. These solutions are exact and heuristic, but all the exact approach...
متن کاملExact maximum coverage probabilities of confidence intervals with increasing bounds for Poisson distribution mean
A Poisson distribution is well used as a standard model for analyzing count data. So the Poisson distribution parameter estimation is widely applied in practice. Providing accurate confidence intervals for the discrete distribution parameters is very difficult. So far, many asymptotic confidence intervals for the mean of Poisson distribution is provided. It is known that the coverag...
متن کامل